The Size of the Largest Part of Random Plane Partitions of Large Integers

نویسنده

  • Ljuben Mutafchiev
چکیده

We study the asymptotic behavior of the largest part size of a plane partition ω of the positive integer n, assuming that ω is chosen uniformly at random from the set of all such partitions. We prove that this characteristic, appropriately normalized, tends weakly, as n → ∞, to a random variable having an extreme value probability distribution with distribution function, equal to e−e −z ,−∞ < z < ∞. The representation of a plane partition as a solid diagram shows that the same limit theorem holds for the numbers of rows and columns of a random plane partition of n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Size of the Largest Part of Random Weighted Partitions of Large Integers

A weighted partition of the positive integer n is a multiset of size n whose decomposition into a union of disjoint components (parts) satisfies the following condition: for a given sequence of non-negative numbers {bk}k≥1, a part of size k appears in exactly one of bk possible types. Assuming that a weighted partition of n is selected uniformly at random from the set of all such partitions, we...

متن کامل

Analysis of Some New Partition Statistics

The study of partition statistics can be said to have begun with Erdős and Lehner [3] in 1941, who studied questions concerning the normal, resp. average value over all partitions of n of quantities such as the number of parts, the number of different part sizes, and the size of the largest part. To begin with, instead of looking at parts in partitions we will look at gaps, that is, at part siz...

متن کامل

A Note on Goldbach Partitions of Large Even Integers

Let Σ2n be the set of all partitions of the even integers from the interval (4, 2n], n > 2, into two odd prime parts. We show that |Σ2n| ∼ 2n2/ log n as n → ∞. We also assume that a partition is selected uniformly at random from the set Σ2n. Let 2Xn ∈ (4, 2n] be the size of this partition. We prove a limit theorem which establishes that Xn/n converges weakly to the maximum of two random variabl...

متن کامل

Random Sampling of Plane Partitions

This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity is O(n(lnn)3) in approximate-size sampling and O(n4/3) in exact-size sampling (under a real-arithmetic computation mode...

متن کامل

Shuffling algorithm for boxed plane partitions

We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from a × b × c to (a − 1)× (b + 1)× c or (a + 1)× (b − 1)× c. Algorithmic realization of each step involves O((a+ b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006